Anonymity and Censorship Resistance in Unstructured Overlay Networks
Identifieur interne : 000597 ( Main/Exploration ); précédent : 000596; suivant : 000598Anonymity and Censorship Resistance in Unstructured Overlay Networks
Auteurs : Michael Backes [Allemagne] ; Marek Hamerlik [Allemagne] ; Alessandro Linari [Royaume-Uni] ; Matteo Maffei [Allemagne] ; Christos Tryfonopoulos [Allemagne] ; Gerhard Weikum [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
English descriptors
- Teeft :
- Algorithm, Anonymity, Anonymity degree, Anonymous communication, Appropriate cluster, Attack scenarios, Attackers need, Average number, Backes, Baseline value, Best strategy, Broadcast threshold, Cardinality, Censorship, Censorship resistance, Censorship resistance properties, Centralised infrastructures, Cloud, Cloud creation, Cloud creation algorithm, Cloud creation process, Cloud intersections, Cloud locality, Cloud size, Cloud topology, Colluding attackers, Communication channel, Communication level, Communication protocol, Communications security, Cryptographic protocol, Data communications, Data model, Destination cloud, Different attack scenarios, Different attacks, Direct connections, Encrypted messages, Experimental evaluation, Experimental results, Extra message, Footprint, Footprint list, Future work, Guarantee anonymity, High cardinality, Honest participants, Honest peers, Important observation, Information exchange, Information providers, Information retrieval, Information systems, Initiator, Interesting observation, International conference, International workshop, Intersection attack, Intersection attacks, Intersection cardinality, Intersections intersections, Joincloud messages, Large fraction, Last steps, Last years, Limited broadcast, Malicious, Malicious peer, Malicious peers, Mdata, Mdata messages, Message content, Message history, Neighbour, Other approaches, Other neighbours, Other peers, Overlay, Overlay network, Overlay networks, Peer, Protocol, Provider, Publishing system, Query, Query language, Query message, Random value, Resource, Resource description, Resource provider, Resource providers, Retrieval, Retrieval capabilities, Rich data model, Scenario, Search functionality, Search infrastructure, Security guarantees, Security properties, Semantic correlation, Semantic overlay networks, Server, Similar peers, Similarity function, Single topic, Social network, Social networking, Social networks, Special interest group, Static paths, Step numbe, Subsequent messages, Sybil, Sybil attack, Sybil attacks, System security, Trust relationships, Ubmit, Unstructured networks, Unstructured overlay network, Unstructured overlay networks, Usenix security symposium.
Abstract
Abstract: This paper presents Clouds, a peer-to-peer protocol that guarantees both anonymity and censorship resistance in semantic overlay networks. The design of such a protocol needs to meet a number of challenging goals: enabling the exchange of encrypted messages without assuming previously shared secrets, avoiding centralised infrastructures, like trusted servers or gateways, and guaranteeing efficiency without establishing direct connections between peers. Anonymity is achieved by cloaking the identity of protocol participants behind groups of semantically close peers. Censorship resistance is guaranteed by a cryptographic protocol securing the anonymous communication between the querying peer and the resource provider. Although we instantiate our technique on semantic overlay networks to exploit their retrieval capabilities, our framework is general and can be applied to any unstructured overlay network. Experimental results demonstrate the security properties of Clouds under different attacks and show the message overhead and retrieval effectiveness of the protocol.
Url:
DOI: 10.1007/978-3-642-05148-7_12
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000D88
- to stream Istex, to step Curation: 000D21
- to stream Istex, to step Checkpoint: 000434
- to stream Main, to step Merge: 000597
- to stream Main, to step Curation: 000597
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Anonymity and Censorship Resistance in Unstructured Overlay Networks</title><author><name sortKey="Backes, Michael" sort="Backes, Michael" uniqKey="Backes M" first="Michael" last="Backes">Michael Backes</name></author><author><name sortKey="Hamerlik, Marek" sort="Hamerlik, Marek" uniqKey="Hamerlik M" first="Marek" last="Hamerlik">Marek Hamerlik</name></author><author><name sortKey="Linari, Alessandro" sort="Linari, Alessandro" uniqKey="Linari A" first="Alessandro" last="Linari">Alessandro Linari</name></author><author><name sortKey="Maffei, Matteo" sort="Maffei, Matteo" uniqKey="Maffei M" first="Matteo" last="Maffei">Matteo Maffei</name></author><author><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:85E7846654A163C360D11073FD9455D5794F317F</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-05148-7_12</idno><idno type="url">https://api.istex.fr/document/85E7846654A163C360D11073FD9455D5794F317F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000D88</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000D88</idno><idno type="wicri:Area/Istex/Curation">000D21</idno><idno type="wicri:Area/Istex/Checkpoint">000434</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000434</idno><idno type="wicri:doubleKey">0302-9743:2009:Backes M:anonymity:and:censorship</idno><idno type="wicri:Area/Main/Merge">000597</idno><idno type="wicri:Area/Main/Curation">000597</idno><idno type="wicri:Area/Main/Exploration">000597</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Anonymity and Censorship Resistance in Unstructured Overlay Networks</title><author><name sortKey="Backes, Michael" sort="Backes, Michael" uniqKey="Backes M" first="Michael" last="Backes">Michael Backes</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Hamerlik, Marek" sort="Hamerlik, Marek" uniqKey="Hamerlik M" first="Marek" last="Hamerlik">Marek Hamerlik</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Linari, Alessandro" sort="Linari, Alessandro" uniqKey="Linari A" first="Alessandro" last="Linari">Alessandro Linari</name><affiliation wicri:level="1"><country xml:lang="fr">Royaume-Uni</country><wicri:regionArea>Oxford Brookes University & Nominet</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Royaume-Uni</country></affiliation></author><author><name sortKey="Maffei, Matteo" sort="Maffei, Matteo" uniqKey="Maffei M" first="Matteo" last="Maffei">Matteo Maffei</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Anonymity</term><term>Anonymity degree</term><term>Anonymous communication</term><term>Appropriate cluster</term><term>Attack scenarios</term><term>Attackers need</term><term>Average number</term><term>Backes</term><term>Baseline value</term><term>Best strategy</term><term>Broadcast threshold</term><term>Cardinality</term><term>Censorship</term><term>Censorship resistance</term><term>Censorship resistance properties</term><term>Centralised infrastructures</term><term>Cloud</term><term>Cloud creation</term><term>Cloud creation algorithm</term><term>Cloud creation process</term><term>Cloud intersections</term><term>Cloud locality</term><term>Cloud size</term><term>Cloud topology</term><term>Colluding attackers</term><term>Communication channel</term><term>Communication level</term><term>Communication protocol</term><term>Communications security</term><term>Cryptographic protocol</term><term>Data communications</term><term>Data model</term><term>Destination cloud</term><term>Different attack scenarios</term><term>Different attacks</term><term>Direct connections</term><term>Encrypted messages</term><term>Experimental evaluation</term><term>Experimental results</term><term>Extra message</term><term>Footprint</term><term>Footprint list</term><term>Future work</term><term>Guarantee anonymity</term><term>High cardinality</term><term>Honest participants</term><term>Honest peers</term><term>Important observation</term><term>Information exchange</term><term>Information providers</term><term>Information retrieval</term><term>Information systems</term><term>Initiator</term><term>Interesting observation</term><term>International conference</term><term>International workshop</term><term>Intersection attack</term><term>Intersection attacks</term><term>Intersection cardinality</term><term>Intersections intersections</term><term>Joincloud messages</term><term>Large fraction</term><term>Last steps</term><term>Last years</term><term>Limited broadcast</term><term>Malicious</term><term>Malicious peer</term><term>Malicious peers</term><term>Mdata</term><term>Mdata messages</term><term>Message content</term><term>Message history</term><term>Neighbour</term><term>Other approaches</term><term>Other neighbours</term><term>Other peers</term><term>Overlay</term><term>Overlay network</term><term>Overlay networks</term><term>Peer</term><term>Protocol</term><term>Provider</term><term>Publishing system</term><term>Query</term><term>Query language</term><term>Query message</term><term>Random value</term><term>Resource</term><term>Resource description</term><term>Resource provider</term><term>Resource providers</term><term>Retrieval</term><term>Retrieval capabilities</term><term>Rich data model</term><term>Scenario</term><term>Search functionality</term><term>Search infrastructure</term><term>Security guarantees</term><term>Security properties</term><term>Semantic correlation</term><term>Semantic overlay networks</term><term>Server</term><term>Similar peers</term><term>Similarity function</term><term>Single topic</term><term>Social network</term><term>Social networking</term><term>Social networks</term><term>Special interest group</term><term>Static paths</term><term>Step numbe</term><term>Subsequent messages</term><term>Sybil</term><term>Sybil attack</term><term>Sybil attacks</term><term>System security</term><term>Trust relationships</term><term>Ubmit</term><term>Unstructured networks</term><term>Unstructured overlay network</term><term>Unstructured overlay networks</term><term>Usenix security symposium</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper presents Clouds, a peer-to-peer protocol that guarantees both anonymity and censorship resistance in semantic overlay networks. The design of such a protocol needs to meet a number of challenging goals: enabling the exchange of encrypted messages without assuming previously shared secrets, avoiding centralised infrastructures, like trusted servers or gateways, and guaranteeing efficiency without establishing direct connections between peers. Anonymity is achieved by cloaking the identity of protocol participants behind groups of semantically close peers. Censorship resistance is guaranteed by a cryptographic protocol securing the anonymous communication between the querying peer and the resource provider. Although we instantiate our technique on semantic overlay networks to exploit their retrieval capabilities, our framework is general and can be applied to any unstructured overlay network. Experimental results demonstrate the security properties of Clouds under different attacks and show the message overhead and retrieval effectiveness of the protocol.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Royaume-Uni</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Backes, Michael" sort="Backes, Michael" uniqKey="Backes M" first="Michael" last="Backes">Michael Backes</name></noRegion><name sortKey="Hamerlik, Marek" sort="Hamerlik, Marek" uniqKey="Hamerlik M" first="Marek" last="Hamerlik">Marek Hamerlik</name><name sortKey="Maffei, Matteo" sort="Maffei, Matteo" uniqKey="Maffei M" first="Matteo" last="Maffei">Matteo Maffei</name><name sortKey="Tryfonopoulos, Christos" sort="Tryfonopoulos, Christos" uniqKey="Tryfonopoulos C" first="Christos" last="Tryfonopoulos">Christos Tryfonopoulos</name><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name></country><country name="Royaume-Uni"><noRegion><name sortKey="Linari, Alessandro" sort="Linari, Alessandro" uniqKey="Linari A" first="Alessandro" last="Linari">Alessandro Linari</name></noRegion><name sortKey="Linari, Alessandro" sort="Linari, Alessandro" uniqKey="Linari A" first="Alessandro" last="Linari">Alessandro Linari</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000597 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000597 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:85E7846654A163C360D11073FD9455D5794F317F
|texte= Anonymity and Censorship Resistance in Unstructured Overlay Networks
}}
| This area was generated with Dilib version V0.6.33. |  |